import java.util.Arrays;

class Solution62_2 {
    public static int uniquePaths(int m, int n) {
       if(m <=1 && n <= n) return 0 ; 
       int[][] dp = new int[m+1][n+1] ;
       for(int i=1 ; i <= m ; i ++){
        for(int j=1 ; j <= n ; j ++){
          if(i == 1 && j == 1){
            dp[i][j] = 1 ;
          }else{
          dp[i][j] = dp[i-1][j] + dp[i][j-1] ;
          }
        }
       }
       return dp[m][n] ; 
    }

    public static void main(String[] args) {
        System.out.println(uniquePaths(1, 2));
        Integer[]arr  = new Integer[10];
        Arrays.sort(arr , (o1 , o2)->{
            return 1 ;} );
        char[] arr2 = {'1', '2'} ;
        String str =new String(arr2);

    }
}
